Optimization problems with evidential linear objective

We investigate a general optimization problem with linear objective in which the coefficients are uncertain and uncertainty is represented by belief function. consider five common criteria to compare solutions this setting: generalized Hurwicz, strong dominance, weak maximality E-admissibility. provide characterizations for non-dominated respect these when focal sets of function Cartesian products compact sets. These correspond established concepts optimization. They make it possible find solving known variants deterministic version or even, some cases, simply version.